A Methodology for Automated Cartographic Data Input, Drawing and Editing Using Kinetic Delaunay/Voronoi Diagrams
نویسندگان
چکیده
1 Faculty of Advanced Technology, University of Glamorgan, Pontypridd, Wales, CF37 1DL, UK {cmgold,mdakowic}@glam.ac.uk 2 Department of Geodesy and Geomatics Engineering, University of New Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada E3B 5A3 [email protected] 3 Informatics and Mathematical Modelling, Technical University of Denmark, Richard Petersens Plads, Building 321, 2800 Kgs. Lyngby, Denmark {fa,os}@imm.dtu.dk
منابع مشابه
Dynamic Cartography Using Voronoi/delaunay Methods
We describe two reversible line-drawing methods for cartographic applications based on the kinetic (moving-point) Voronoi diagram. Our objectives were to optimize the user’s ability to draw and edit the map, rather than to produce the most efficient batch-oriented algorithm for large data sets, and all our algorithms are based on local operations (except for basic point location). Because the d...
متن کاملStructuring Kinetic Maps
We attempt to show that a tessellated spatial model has definite advantages for cartographic applications, and facilitates a kinetic structure for map updating and simulation. We develop the moving-point Delaunay/Voronoi model that manages collision detection snapping and intersection at the data input stage by maintaining a topology based on a complete tessellation. We show that the Constraine...
متن کاملVector Weighted Anisotropic Voronoi Diagrams and Delaunay Traingulations
We introduce a weighting scheme for Voronoi diagrams that has preferred directions. This generalizes the concept of weighted Delaunay triangulations and overcomes some of the difficulties of using multiplicative anisotropic weight systems. We discuss properties that make these weighting schemes attractive.
متن کاملCompact Voronoi Diagrams for Moving Convex Polygons
We describe a kinetic data structure for maintaining a compact Voronoi-like diagram of convex polygons moving around in the plane. We use a compact diagram for the polygons, dual to the Voronoi, first presented in [MKS96]. A key feature of this diagram is that its size is only a function of the number of polygons and not of their complexity. We demonstrate a local certifying property of that di...
متن کاملVoronoi diagrams in Cgal
In this paper we describe a generic C++ adaptor, that adapts a 2-dimensional triangulated Delaunay graph and to the corresponding a Voronoi diagram, represented as a doubly connected edge list (DCEL) data structure. Our adaptor has the ability to automatically eliminate, in a consistent manner, degenerate features of the Voronoi diagram, that are artifacts of the requirement that Delaunay graph...
متن کامل